- exponentiations
- n. raising of a number to a power (in Computers - by using the command EXP or the letter E)

*English contemporary dictionary.
2014.*

- exponentiations
- n. raising of a number to a power (in Computers - by using the command EXP or the letter E)

*English contemporary dictionary.
2014.*

**Diffie–Hellman key exchange**— (D–H)[nb 1] is a specific method of exchanging keys. It is one of the earliest practical examples of key exchange implemented within the field of cryptography. The Diffie–Hellman key exchange method allows two parties that have no prior knowledge … Wikipedia**Primality certificate**— In mathematics and computer science, a primality certificate or primality proof is a succinct, formal proof that a number is prime. Primality certificates allow the primality of a number to be rapidly checked without having to run an expensive or … Wikipedia**ElGamal encryption**— In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public key cryptography which is based on the Diffie Hellman key agreement. It was described by Taher Elgamal in 1984 [Taher ElGamal, A Public Key… … Wikipedia**Digital Signature Algorithm**— The Digital Signature Algorithm (DSA) is a United States Federal Government standard or FIPS for digital signatures. It was proposed by the National Institute of Standards and Technology (NIST) in August 1991 for use in their Digital Signature… … Wikipedia**Graham's number**— Graham s number, named after Ronald Graham, is a large number that is an upper bound on the solution to a certain problem in Ramsey theory. This number gained a degree of popular attention when Martin Gardner described it in the Mathematical… … Wikipedia**Mathematical table**— Before calculators were cheap and plentiful, people would use mathematical tables lists of numbers showing the results of calculation with varying arguments to simplify and drastically speed up computation. Tables of logarithms and trigonometric… … Wikipedia**Pollard's p - 1 algorithm**— Pollard s p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest … Wikipedia**Mental poker**— is the common name for a set of cryptographic problems that concerns playing a fair game over distance without the need for a trusted third party. The term is also applied to the theories surrounding these problems and their possible solutions.… … Wikipedia**Three-pass protocol**— In cryptography, the three pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. This message protocol should not be… … Wikipedia**Socialist millionaire**— The Socialist Millionaire Problemcite conference author = M. Jakobsson, M. Yung title = Proving without knowing: On oblivious, agnostic and blindfolded provers. booktitle = Advances in Cryptology CRYPTO 96, volume 1109 of Lecture Notes in… … Wikipedia